A note on the hierarchical multi-switch multi-echelon vehicle routing problem

Abstract This paper introduces the Hierarchical Multi-Switch Multi-Echelon Vehicle Routing Problem, a new variant of well-known Problem. It is real-world problem originating from policies Nordic distribution company. The includes single depot, non-predetermined hierarchy intermediate facilities, and two different fleets, consisting homogeneous original local vehicles, which are pulling swap-bodies. Original vehicles with attached swap-bodies depart central depot. They can either visit customers directly if only one swap-body or consecutive switch points in order to transfer loaded corresponding number subsequently routed while vehicle itself proceeds serve remaining swap-body. A mixed-integer formulation proposed. short bibliographic review, relations, shared characteristics, differences proposed several known VRP variants analyzed discussed. solution an illustrative instance presented demonstrate concept for as well compare concepts previously stated variants. Computational experiments on small instances that could be solved within hour also presented. computationally hard solve. Thus, development heuristics metaheuristics important future task enable real case realistic sizes.